Browsing by Author "Johansson, M."
Now showing items 1-20 of 20
-
Conference Object
Approximation of Markov processes by lower dimensional processes
Tzortzis, I.; Charalambous, C. D.; Charalambous, T.; Hadjicostis, Christoforos N.; Johansson, M. (Institute of Electrical and Electronics Engineers Inc., 2014)In this paper, we investigate the problem of aggregating a given finite-state Markov process by another process with fewer states. The aggregation utilizes total variation distance as a measure of discriminating the Markov ...
-
Conference Object
Approximation of Markov processes by lower dimensional processes
Tzortzis, I.; Charalambous, Charalambos D.; Charalambous, T.; Hadjicostis, Christoforos N.; Johansson, M. (Institute of Electrical and Electronics Engineers Inc., 2014)In this paper, we investigate the problem of aggregating a given finite-state Markov process by another process with fewer states. The aggregation utilizes total variation distance as a measure of discriminating the Markov ...
-
Article
Approximation of Markov Processes by Lower Dimensional Processes via Total Variation Metrics
Tzortzis, I.; Charalambous, Charalambos D.; Charalambous, T.; Hadjicostis, Christoforos N.; Johansson, M. (2017)The aim of this paper is to approximate a Finite-State Markov (FSM) process by another process defined on a lower dimensional state space, called the approximating process, with respect to a total variation distance fidelity ...
-
Article
Approximation of Markov Processes by Lower Dimensional Processes via Total Variation Metrics
Tzortzis, I.; Charalambous, C. D.; Charalambous, T.; Hadjicostis, Christoforos N.; Johansson, M. (2017)The aim of this paper is to approximate a Finite-State Markov (FSM) process by another process defined on a lower dimensional state space, called the approximating process, with respect to a total variation distance fidelity ...
-
Article
A buffer-aided successive opportunistic relay selection scheme with power adaptation and inter-relay interference cancellation for cooperative diversity systems
Nomikos, N.; Charalambous, T.; Krikidis, Ioannis A.; Skoutas, D. N.; Vouyioukas, D.; Johansson, M. (2015)
-
Conference Object
Buffer-aided successive opportunistic relaying with inter-relay interference cancellation
Nomikos, N.; Charalambous, T.; Krikidis, Ioannis A.; Skoutas, D. N.; Vouyioukas, D.; Johansson, M. (2013)
-
Conference Object
Capacity improvement through buffer-aided successive opportunistic relaying
Nomikos, N.; Vouyioukas, D.; Charalambous, T.; Krikidis, Ioannis A.; Skoutas, D. N.; Johansson, M. (2013)
-
Conference Object
Decentralised minimum-time average consensus in digraphs
Charalambous, T.; Yuan, Y.; Yang, T.; Pan, W.; Hadjicostis, Christoforos N.; Johansson, M. (Institute of Electrical and Electronics Engineers Inc., 2013)Distributed algorithms for average consensus in directed graphs are typically asymptotic in the literature. In this work, we propose a protocol to distributively reach average consensus in a finite number of steps on ...
-
Conference Object
Delay-and diversity-Aware buffer-Aided relay selection policies in cooperative networks
Poulimeneas, D.; Charalambous, T.; Nomikos, N.; Krikidis, Ioannis A.; Vouyioukas, D.; Johansson, M. (2016)
-
Conference Object
A delay-aware hybrid relay selection policy
Poulimeneas, D.; Charalambous, T.; Nomikos, N.; Krikidis, Ioannis A.; Vouyioukas, D.; Johansson, M. (2016)
-
Article
Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays
Charalambous, T.; Yuan, Y.; Yang, T.; Pan, W.; Hadjicostis, Christoforos N.; Johansson, M. (2015)Most algorithms for distributed averaging only guarantee asymptotic convergence. This paper introduces a distributed protocol that allows nodes to find the exact average of the initial values in a finite and minimum number ...
-
Article
Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
Charalambous, T.; Rabbat, M. G.; Johansson, M.; Hadjicostis, Christoforos N. (2016)Many of the algorithms that have been proposed in the field of distributed computation rely on assumptions that require nodes to be aware of some global parameters. In this paper, we propose algorithms to compute some ...
-
Conference Object
Distributed minimum-time weight balancing over digraphs
Charalambous, T.; Hadjicostis, Christoforos N.; Johansson, M. (IEEE Computer Society, 2014)We address the weight-balancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology (digraph). ...
-
Conference Object
Distributed network size estimation and average degree estimation and control in networks isomorphic to directed graphs
Shames, I.; Charalambous, T.; Hadjicostis, Christoforos N.; Johansson, M. (2012)Many properties of interest in graph structures are based on the nodes' average degree (i.e., the average number of edges incident to/from each node). In this work, we present asynchronous distributed algorithms, based on ...
-
Conference Object
Hybrid cooperation through full-duplex opportunistic relaying and max-link relay selection with transmit power adaptation
Nomikos, N.; Charalambous, T.; Krikidis, Ioannis A.; Vouyioukas, D.; Johansson, M. (2014)
-
Article
Joint relay-pair selection for buffer-aided successive opportunistic relaying
Nomikos, N.; Vouyioukas, D.; Charalambous, T.; Krikidis, Ioannis A.; Makris, P.; Skoutas, D. N.; Johansson, M.; Skianis, C. (2014)
-
Article
Modeling buffer-aided relay selection in networks with direct transmission capability
Charalambous, T.; Nomikos, N.; Krikidis, Ioannis A.; Vouyioukas, D.; Johansson, M. (2015)
-
Conference Object
Precoding decision for full-duplex X-relay channel with Decode-And-Forward
Charalambous, T.; Krikidis, Ioannis A.; Johansson, M. (2014)
-
Article
A Survey on Buffer-Aided Relay Selection
Nomikos, N.; Charalambous, T.; Krikidis, Ioannis A.; Skoutas, D. N.; Vouyioukas, D.; Johansson, M.; Skianis, C. (2016)
-
Conference Object
Totally asynchronous distributed estimation of eigenvector centrality in digraphs with application to the PageRank problem
Charalambous, T.; Hadjicostis, Christoforos N.; Rabbat, M. G.; Johansson, M. (Institute of Electrical and Electronics Engineers Inc., 2016)We propose a distributed coordination mechanism which enables nodes in a directed graph to accurately estimate their eigenvector centrality (eigencentrality) even if they update their values at times determined by their ...